Predicate transformers for extended probability and non-determinism
نویسندگان
چکیده
منابع مشابه
Predicate transformers for extended probability and non-determinism
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to conical powerdomains, the appropriate powerdomains for the combi...
متن کاملNon-Deterministic Expressions and Predicate Transformers
Non-determinacy is important in the formal specification and formal derivation of programs, but non-determinacy within expressions is theoretically problematical. The refinement calculus side-steps the problem by admitting non-determinacy only at the level of statements, leading to a style of programming that favours statements and procedures over expressions and functions. But expressions are ...
متن کاملDistributing probability over non-determinism
We study the combination of probability and nondeterminism from a categorical point of view. In category theory, nondeterminism and probability are represented by suitable monads. Those two monads do not combine well, as they are. To overcome this problem we introduce the notion of indexed valuations. This notion is used to define a new monad that can be combined with the usual nondeterministic...
متن کاملPredicate Transformers for Convex Powerdomains
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...
متن کاملHealthiness Conditions for Predicate Transformers
The behavior of a program can be modeled by describing how it transforms input states to output states, the state transformer semantics. Alternatively, for verification purposes one is interested in a ’predicate transformer semantics’ which, for every condition on the output, yields the weakest precondition on the input that guarantees the desired property for the output. In the presence of com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2009
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129509007555